The GrGen.NET User Manual. Refers to GrGen.NET User Manual, www.grgen.net

GrGen.NET is a graph rewrite tool enabling elegant and convenient development of graph rewriting applications with comparable performance to conventionally developed ones. GrGen.NET uses attributed, typed, and directed multigraphs with multiple inheritance on node and edge types. Extensive graphical debugging integrated into an interactive shell complements the feature highlights of GrGen.NET. This user manual contains both, normative statements in the sense of a reference manual as well as an informal guide to the features and usage of GrGen.NET

Firm. An intermediate language for compiler research

State of the art compiler intermediate representations incorporate SSA data dependencies in a graph based manner. We present the intermediate representation Firm, which extends the functional stores of Steensgard and introduces a novel representation of exceptions. Firm offers a high-level representation of the type hierarchy and object-oriented features, which makes it exceptional suitable for analysing and optimizing of strongly typed languages. The construction interface automates value numbering and the generation of SSA typical Phi operations. Firm comes with a full blown range of standard optimizations and analyses. In the paper we show that Firm requires 53% less operationss and 80% less Phi operations than the SSA representation of the gcc compiler

Strategic programming on graph rewriting systems

We describe a strategy language to control the application of graph rewriting rules, and show how this language can be used to write high-level declarative programs in several application areas. This language is part of a graph-based programming tool built within the port-graph transformation and visualisation environment PORGY.Comment: In Proceedings IWS 2010, arXiv:1012.533

PORGY: Strategy-Driven Interactive Transformation of Graphs

This paper investigates the use of graph rewriting systems as a modelling tool, and advocates the embedding of such systems in an interactive environment. One important application domain is the modelling of biochemical systems, where states are represented by port graphs and the dynamics is driven by rules and strategies. A graph rewriting tool's capability to interactively explore the features of the rewriting system provides useful insights into possible behaviours of the model and its properties. We describe PORGY, a visual and interactive tool we have developed to model complex systems using port graphs and port graph rewrite rules guided by strategies, and to navigate in the derivation history. We demonstrate via examples some functionalities provided by PORGY.Comment: In Proceedings TERMGRAPH 2011, arXiv:1102.226

Graph Rewriting for Hardware Dependent Program Optimizations

We present a compiler internal program optimization that uses graph rewriting. This optimization enables the compiler to automatically use rich instructions provided by modern CPUs and is transparent to the user of the compiler. New instructions can be introduced easily by specifying their behaviour in a high-level programming language. The optimization is integrated into an existing compiler, gaining high speedup

Developing graph transformations with GrGen.NET

GrGen.NET is a graph rewrite system enabling elegant and convenient development of applications with comparable performance to conventionally developed ones. GrGen.NET uses attributed, typed, and directed multigraphs with multiple inheritance on node and edge types. Extensive graphical debugging integrated into an interactive shell complements the feature highlights of GrGen.NET. In this paper, the above claims are illustrated by examples